Abstract-driven pattern discovery in databases
نویسندگان
چکیده
منابع مشابه
Abstract-Driven Pattern Discovery in Databases
Driven Pattern Discovery In Databases Vasant Dhar and Alexander Tuzhilin Department of Information, Operations and Management Sciences Leonard N. Stem School of Business, New York University 44 West 4th Street, New York, NY 10012 vdhar@,stern.nvu.edu, atuzhilin@,stern.nvu.edu Center for Digltzl Economy Rrsaarch Stern School of Bushess W o r h g Paper IS-93-1 1 Abstract-Driven Pattern Discovery ...
متن کاملSupporting Interactive Sequential Pattern Discovery in Databases
One of the most important data mining problems is discovery of sequential patterns. Sequential pattern mining consists in discovering all frequently occurring subsequences in a collection of data sequences. This paper discusses several issues concerning possible extensions to traditional database management systems required to support sequential pattern discovery: a sequential pattern query lan...
متن کاملAbstract Representations and Frequent Pattern Discovery
We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be cast into the powerful language of algorithmic information theory. This allows us to formulate a simple algorithm to mine for all frequent patterns. 1
متن کاملPattern Discovery in Temporal Databases: Some Recent Results
In their influential paper [MTV95], Mannila et al. formulated the problem of discovering frequently occurring temporal patterns in sequences, where temporal patterns are specified using the notion of an episode [MTV95]. It has been recognized by Padmanabhan and Tuzhilin [PT96] that temporal patterns can be specified using temporal logic and that this method generalizes the episodes approach pro...
متن کاملData-Driven Discovery of Quantitative Rules in Relational Databases
A quantitative rule is a rule associated with quantitative information which assesses the representativeness of the rule in the database. In this paper, an efficient induction method is developed for learning quantitative rules in relational databases. With the assistance of knowledge about concept hierarchies, data relevance, and expected rule forms, attribute-oriented induction can be perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 1993
ISSN: 1041-4347
DOI: 10.1109/69.250075